1 1 Penalty Search
نویسنده
چکیده
This paper describes penalty search based on a modified neighborhood search where move and solution penalty functions attempt to keep the search process out of recently "explored" regions. During the penalty search process trajectories which may cause a cycle or drive the search process towards recently found local optimums are made "less attractive" by using penalty parameters. Penalty search has been extended by the idea of reactive search, which is based on a "reactive" mechanism for the determination of search parameters. In reactive penalty search penalty parameters are determined and readjusted considering the past behavior of the search process.
منابع مشابه
1 Penalty Search
This paper describes penalty search based on a modified neighborhood search where move and solution penalty functions attempt to keep the search process out of recently "explored" regions. During the penalty search process trajectories which may cause a cycle or drive the search process towards recently found local optimums are made "less attractive" by using penalty parameters. Penalty search ...
متن کاملA Derivative-Free Algorithm for Constrained Global Optimization Based on Exact Penalty Functions
Constrained global optimization problems can be tackled by using exact penalty approaches. In a preceding paper, we proposed an exact penalty algorithm for constrained problems which combines an unconstrained global minimization technique for minimizing a non-differentiable exact penalty function for given values of the penalty parameter, and an automatic updating of the penalty parameter that ...
متن کاملSteering Exact Penalty Methods for Optimization
This paper reviews, extends and analyzes a new class of penalty methods for nonlinear optimization. These methods adjust the penalty parameter dynamically; by controlling the degree of linear feasibility achieved at every iteration, they promote balanced progress toward optimality and feasibility. In contrast with classical approaches, the choice of the penalty parameter ceases to be a heuristi...
متن کاملSteering exact penalty methods for nonlinear programming
This paper reviews, extends and analyzes a new class of penalty methods for nonlinear optimization. These methods adjust the penalty parameter dynamically; by controlling the degree of linear feasibility achieved at every iteration, they promote balanced progress toward optimality and feasibility. In contrast with classical approaches, the choice of the penalty parameter ceases to be a heuristi...
متن کاملRamp loss linear programming support vector machine
The ramp loss is a robust but non-convex loss for classification. Compared with other non-convex losses, a local minimum of the ramp loss can be effectively found. The effectiveness of local search comes from the piecewise linearity of the ramp loss. Motivated by the fact that the `1-penalty is piecewise linear as well, the `1-penalty is applied for the ramp loss, resulting in a ramp loss linea...
متن کامل